Anti-Ramsey numbers in complete split graphs
نویسندگان
چکیده
منابع مشابه
Anti-Ramsey numbers in complete split graphs
A subgraph of an edge-coloured graph is rainbow if all of its edges have different colours. For graphs G and H the anti-Ramsey number ar(G,H) is the maximum number of colours in an edge-colouring of G with no rainbow copy of H. The notion was introduced by Erdős, Simonovits and V. Sós and studied in case G = Kn. Afterwards exact values or bounds for anti-Ramsey numbers ar(Kn, H) were establishe...
متن کاملGeneralized Split Graphs and Ramsey Numbers
A graph G is called a ( p, q)-split graph if its vertex set can be partitioned into A, B so that the order of the largest independent set in A is at most p and the order of the largest complete subgraph in B is at most q. Applying a well-known theorem of Erdo s and Rado for 2-systems, it is shown that for fixed p, q, ( p, q)-split graphs can be characterized by excluding a finite set of forbidd...
متن کاملSome Ramsey numbers for complete bipartite graphs
Upper bounds are determined for the Ramsey number ](m,n), 2 :; m n. These bounds are attained for infinitely many n in case of m 3 and are fairly close to the exact value for every m if n is sufficiently large.
متن کاملLocal Anti-Ramsey Numbers of Graphs
In an edge-coloured host graph G, a subgraph H is properly coloured if no two incident edges of H receive the same colour, and rainbow if no two edges of H receive the same colour. Given a positive integer k, a host graph G, an edge-colouring c of G (c is not necessarily proper), then c is a k-colouring if c uses k colours overall, c is a local k-colouring if at most k colours are used at each ...
متن کاملMulticolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs
Let H1, . . . ,Hk be graphs. The multicolor Ramsey number r(H1, . . . ,Hk) is the minimum integer r such that in every edge-coloring of Kr by k colors, there is a monochromatic copy of Hi in color i for some 1 ≤ i ≤ k. In this paper, we investigate the multicolor Ramsey number r(K2,t, . . . ,K2,t,Km), determining the asymptotic behavior up to a polylogarithmic factor for almost all ranges of t ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.10.038